Linearizable special cases of the QAP
نویسندگان
چکیده
منابع مشابه
Linearizable special cases of the QAP
We consider special cases of the quadratic assignment problem (QAP) that are linearizable in the sense of Bookhold. We provide combinatorial characterizations of the linearizable instances of the weighted feedback arc set QAP, and of the linearizable instances of the traveling salesman QAP. As a by-product, this yields a new well-solvable special case of the weighted feedback arc set problem.
متن کاملWell-solvable cases of the QAP with block-structured matrices
We investigate special cases of the quadratic assignment problem (QAP) where one of the two underlying matrices carries a simple block structure. For the special case where the second underlying matrix is a monotone anti-Monge matrix, we derive a polynomial time result for a certain class of cut problems. For the special case where the second underlying matrix is a product matrix, we identify t...
متن کاملFactors Affecting Academic Failure of the Students Referred to the Commission of Special Cases at The University of Birjand
The purpose of this study was to identify the factors affecting the academic dropout of students referred to the Birjand University of Commerce Affairs Commission. The research was done with a qualitative method and a phenomenological approach. The statistical population of the study was all academic dropout students referred to the special commission for the period 1394 to 1396. The data were ...
متن کاملSpecial Cases of Division
This surveys algorithms and circuits for integer division in special cases. These include division by constants, small divisors, exact divisors, and cases where the divisor and the number base have a special relationship. The related operation of remainder is also covered. Various prior techniques are treated in a common framework. Worked examples are provided together with examples of practica...
متن کاملA linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems
An instance of the quadratic assignment problem (QAP) with cost matrix Q is said to be linearizable if there exists an instance of the linear assignment problem (LAP) with cost matrix C such that for each assignment, the QAP and LAP objective function values are identical. The QAP linearization problem can be solved in O(n) time. However, for the special cases of Koopmans-Beckmann QAP and the m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Optimization
سال: 2014
ISSN: 1382-6905,1573-2886
DOI: 10.1007/s10878-014-9821-2